#include <iostream>
#include <vector>

using namespace std;

class Solution {
public:
  void merge(vector<int> &nums1, int m, vector<int> &nums2, int n) {
    int iter_v1 = 0;
    int iter_v2 = 0;
    vector<int> v3;

    int i = 0;
    int j = 0;
    while (i < m && j < n) {
      iter_v1 = nums1[i];
      iter_v2 = nums2[j];
      if (iter_v1 <= iter_v2) {
        v3.push_back(iter_v1);
        i++;
      } else {
        v3.push_back(iter_v2);
        j++;
      }
    }

    while (i < m) {
      v3.push_back(nums1[i]);
      i++;
    }
    while (j < n) {
      v3.push_back(nums2[j]);
      j++;
    }

    nums1 = v3;
  }
};

int main() { return 0; }
